Generic primal-dual solvability in continuous linear semi-infinite programming
نویسندگان
چکیده
منابع مشابه
A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملPrimal-dual stability in continuous linear optimization
Any linear (ordinary or semi-infinite) optimization problem, and also its dual problem, can be classified as either inconsistent or bounded or unbounded, giving rise to nine duality states, three of them being precluded by the weak duality theorem. The remaining six duality states are possible in linear semi-infinite programming whereas two of them are precluded in linear programming as a conse...
متن کاملPrimal-Dual Enumeration for Multiparametric Linear Programming
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (pLPs) and solved explicitly offline. Several algorithms have recently been proposed in the literature that solve these pLPs in a fairly efficient manner, all of which have as a base operation the computation and removal of redundant constraints. For many problems, it is th...
متن کاملPrimal - dual methods for linear programming
Many interior-point methods for linear programming are based on the properties of the logarithmic barrier function. After a preliminary discussion of the convergence of the (primal) projected Newton barrier method, three types of barrier method are analyzed. These methods may be categorized as primal, dual and primal-dual, and may be derived from the application of Newton’s method to different ...
متن کاملA primal-dual semi-definite programming approach to linear quadratic control
We study a deterministic linear quadratic LQ control problem over an in nite horizon without the restriction that the control cost matrix R or the state cost matrix Q be positive de nite We develop a general approach to the problem based on semi de nite programming SDP and related duality analysis We show that the complementary duality condition of the SDP is necessary and su cient for the exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2008
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331930701779872